On Truncations For A Class Of Finite Markovian Queuing Models
نویسندگان
چکیده
We consider a class of finite Markovian queueing models and obtain uniform approximation bounds of truncations. INTRODUCTION It is well known that explicit expressions for the probability characteristics of stochastic models can be found only in a few special cases, moreover, if we deal with an inhomogeneous Markovian model, then we must approximately calculate the limiting probability characteristics of the process. The problem of calculation of the limiting characteristics for inhomogeneous birth-death process via truncations was firstly mentioned in (Zeifman 1991) and was considered in details in (Zeifman et al. 2006). In (Zeifman et al. 2014b) we have proved uniform (in time) error bounds of truncation this class of Markov chains. First uniform bounds of truncations for the class of Markovian time-inhomogeneous queueing models with batch arrivals and group services (SZK models) introduced and studied in our recent papers (Satin et al. 2013, Zeifman et al. 2014a), were obtained in (Zeifman et al. 2014c). In this note we deal with approximations of finite SZK model via the same models with smaller state space and obtain the correspondent bounds of error of truncation bounds. Consider a time-inhomogeneous continuous-time Markovian queueing model on the state space E = {0, 1, . . . , r} with possible batch arrivals and group services. Let X(t), t ≥ 0 be the queue-length process for the queue, pij(s, t) = P {X(t) = j |X(s) = i}, i, j ≥ 0, 0 ≤ s ≤ t, be transition probabilities for X = X(t), and pi(t) = P {X(t) = i} be its state probabilities. Throughout the paper we assume that P (X (t+ h) = j|X (t) = i) = = { qij (t)h+ αij (t, h) , if j 6= i, 1− ∑ k 6=i qik (t)h+ αi (t, h) , if j = i, (1) where all αi(t, h) are o(h) uniformly in i, i. e., supi |αi(t, h)| = o(h). We also assume qi,i+k (t) = λk(t), qi,i−k (t) = μk(t) for any k > 0. In other words, we suppose that the arrival rates λk(t) and the service rates μk(t) do not depend on the queue length. In addition, we assume that λk+1(t) ≤ λk(t) and μk+1(t) ≤ μk(t) for any k and almost all t ≥ 0. Hence, X(t) is a so-called SZK model, which was studied in (Satin et al. 2013, Zeifman et al. 2014a, 2014c). We suppose that all intensity functions are locally integrable on [0,∞), and λk(t) ≤ λk, μk(t) ≤ μk, (2) for any k and almost all t ≥ 0, and put
منابع مشابه
A Non-Preemptive Two-Class M/M/1 System with Prioritized Real-Time Jobs under Earliest-Deadline-First Policy
This paper introduces an analytical method for approximating the performance of a two-class priority M/M/1 system. The system is fully non-preemptive. More specifically, the prioritized class-1 jobs are real-time and served with the non-preemptive earliest-deadline-first (EDF) policy, but despite their priority cannot preempt any non real-time class-2 job. The waiting class-2 jobs can only be s...
متن کاملA Finite Capacity Priority Queue with Discouragement
In this paper we report on a study of a two level preemptive priority queue with balking and reneging for lower priority level. The inter-arrival and the service times for both levels follow exponential distribution. We use a finite difference equation approach for solving the balance equations of the governing queuing model whose states are described by functions of one independent variable. H...
متن کاملA Single-server Markovian Queuing System with Discouraged Arrivals and Retention of Reneged Customers
Customer impatience has a very negative impact on the queuing system under investigation. If we talk from business point of view, the firms lose their potential customers due to customer impatience, which affects their business as a whole. If the firms employ certain customer retention strategies, then there are chances that a certain fraction of impatient customers can be retained in the queui...
متن کاملOn Truncations For SZK Model
We consider a class of inhomogeneous Markovian queueing models with batch arrivals and group services. Bounds on the truncation errors in weak ergodic case are obtained. Two concrete queueing models are studied as examples.
متن کاملCost Analysis of Fuzzy Queuing Systems
Regarding the fact that getting a suitable combination of the human resources and service stations is one of the important issues in the most service and manufacturing environments, In this paper, we have studied the two models of planning queuing systems and its effect on the cost of the each system by using two fuzzy queuing models of M/M/1 and M/E2/1. In the first section, we have compar...
متن کامل